Structural complexity theory - PDFSEARCH.IO - Document Search Engine

Structural complexity theory
Results: 144

#	Item
21	Policy Sciences), © Elsevier Scientific Publishing Company, Amsterdam--Printed in Scotland Dilemmas in a General Theory of Planning* H O R S T W. J. R I T T E L Add to Reading List Source URL: phobos.ramapo.edu Language: English - Date: 2010-08-06 10:22:41 Cognition Policy Problem solving Wicked problem Neuropsychological assessment Structural complexity theory Computational complexity theory Reduction Design Theoretical computer science Applied mathematics Mathematics
22	Microsoft Word - ReportingAboutDesignResearch.doc Add to Reading List Source URL: wwwhome.cs.utwente.nl Language: English - Date: 2007-02-19 06:08:07 Operations research Structural complexity theory Mathematical optimization Reduction Problem Epistemology Chess problem NP Knowledge Theoretical computer science Applied mathematics Computational complexity theory
23	Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139 Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-05-13 09:33:41 Structural complexity theory Complexity classes Models of computation Lance Fortnow Probabilistic complexity theory Interactive proof system IP Bounded-error probabilistic polynomial Probabilistic Turing machine Theoretical computer science Computational complexity theory Applied mathematics
24	Structural Decomposition Methods and What They are Good For Markus Aschinger1 , Conrad Drescher1 , Georg Gottlob1,2 , Peter Jeavons1 , and Evgenĳ Thorstensen1 1 Computing Laboratory, University of Oxford 2 Oxford Man In Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:11 Graph operations Tree decomposition Decomposition method Path decomposition Parameterized complexity Constraint satisfaction problem Bipartite graph Hypertree Hypergraph Graph theory Theoretical computer science Constraint programming
25	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics
26	Structural Complexity of Vortex Flows by Diagram Analysis and Knot Polynomials Renzo L. Ricca Abstract In this paper I present and discuss with examples new techniques based Add to Reading List Source URL: www.matapp.unimib.it Language: English - Date: 2014-06-22 16:43:35 Mathematics Fluid dynamics Aerodynamics Linking number Vortex Tangle Projection Knot invariant Quantum turbulence Knot theory Topology Geometry
27	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
28	Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:05:44 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory Parameterized complexity P versus NP problem NP-complete NP-hard NP Theoretical computer science Computational complexity theory Applied mathematics
29	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
30	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-05 11:21:00 Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE